Enriched μ-Calculi Module Checking
نویسندگان
چکیده
منابع مشابه
Enriched µ-Calculi Module Checking
The model checking problem for open systems has been widely studied in the literature, for both finite–state (module checking) and infinite–state (pushdown module checking) systems, with respect to CTL and CTL. In this paper, we further investigate this problem with respect to the μ-calculus enriched with nominals and graded modalities (hybrid graded μ-calculus), in both the finite–state and in...
متن کاملEnriched µ-Calculus Pushdown Module Checking
The model checking problem for open systems (called module checking) has been intensively studied in the literature, both for finite–state and infinite–state systems. In this paper, we focus on pushdown module checking with respect to decidable fragments of the fully enriched μ–calculus. We recall that finite–state module checking with respect to fully enriched μ–calculus is undecidable and hen...
متن کاملModule Checking
In computer system design, we distinguish between closed and open systems. A closed system is a system whose behavior is completely determined by the state of the system. An open system is a system that interacts with its environment and whose behavior depends on this interaction. The ability of temporal logics to describe an ongoing interaction of a reactive program with its environment makes ...
متن کاملModel Checking for Nominal Calculi
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model checking a difficult task. In this note we survey some of the approaches for model checking nominal calculi. Then, we focus on History-Dependent automata, a syntax-free automaton-based model of mobility. History-Depend...
متن کاملModule Checking Revisited
When we verify the correctness of an open system with respect to a desired requirement, we should take into consideration the different environments with which the system may interact. Each environment induces a different behavior of the system, and we want all these behaviors to satisfy the requirement. Module checking is an algorithmic method that checks, given an open system (modeled as a fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2008
ISSN: 1860-5974
DOI: 10.2168/lmcs-4(3:1)2008